- time sharing allocator
- распределитель [блок распределения] в системе разделения времени
English-Russian dictionary of computer science and programming. 2013.
time sharing allocator
Смотреть что такое "time sharing allocator" в других словарях:
Hoard memory allocator — The Hoard memory allocator, or Hoard, is a memory allocator for Linux, Solaris, Microsoft Windows and other operating systems. Hoard can improve the performance of multithreaded applications by providing fast, scalable memory management functions … Wikipedia
блок распределения в системе разделения времени — — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом EN time sharing allocator … Справочник технического переводчика
распределитель в системе разделения времени — — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом EN time sharing allocator … Справочник технического переводчика
ICT 1900 — is the name given to a series of mainframe computers released by International Computers and Tabulators (ICT) in the 1960s. 1900 Series computersThese varied in computing power and the models included:* ICT 1901 * ICT 1902 * ICT 1903 * ICT 1904 * … Wikipedia
Memory management — is the act of managing computer memory. The essential requirement of memory management is to provide ways to dynamically allocate portions of memory to programs at their request, and freeing it for reuse when no longer needed. This is critical to … Wikipedia
Java performance — Programs written in Java have had a reputation for being slower and requiring more memory than those written in natively compiled languages such as C or C++ (see e.g. [cite web url=http://www.jelovic.com/articles/why java is slow.htm title=Why… … Wikipedia
computer science — computer scientist. the science that deals with the theory and methods of processing information in digital computers, the design of computer hardware and software, and the applications of computers. [1970 75] * * * Study of computers, their… … Universalium
Linked list — In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the… … Wikipedia
Open Cobalt — Developer(s) Community source and Duke University Initial release 2009 Development … Wikipedia
Shared memory — In computing, shared memory is a memory that may be simultaneously accessed by multiple programs with an intent to provide communication among them or avoid redundant copies. Depending on context, programs may run on a single processor or on… … Wikipedia
Page replacement algorithm — This article is about algorithms specific to paging. For outline of general cache algorithms (e.g. processor, disk, database, web), see Cache algorithms. In a computer operating system that uses paging for virtual memory management, page… … Wikipedia
